منابع مشابه
A note on minimally 3-connected graphs
If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E (G)| ≥ 2 |C| − 2.
متن کاملOn minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7 ≥ n is 9 3 − n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, and is embedded in a closed surface with Euler characteristic , χ then G contains at most } 2 , 2 min{ 2 χ − n edges. This bound is best possible for every closed surface.
متن کاملCharacterization of minimally (2, l)-connected graphs
For an integer l ≥ 2, the l-connectivity κl(G) of a graph G is defined to be the minimum number of vertices of G whose removal produces a disconnected graph with at least l components or a graph with fewer than l vertices. Let k ≥ 1, a graph G is called (k, l)-connected if κl(G) ≥ k. A graph G is called minimally (k, l)-connected if κl(G) ≥ k but ∀e ∈ E(G), κl(G − e) ≤ k − 1. We present a struc...
متن کاملMinimally (k, k-1)-edge-connected graphs
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...
متن کاملNote on minimally k-connected graphs
A k-tree is either a complete graph on (k+1) vertices or given a k-tree G′ with n vertices, a k-tree G with (n+1) vertices can be constructed by introducing a new vertex v and picking a k-clique Q in G′ and then joining each vertex u in Q. A graph G is kedge-connected if the graph remains connected even after deleting fewer edges than k from the graph. A k-edge-connected graph G is said to be m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2021
ISSN: 1999-4893
DOI: 10.3390/a14010009